Accelerating the Numerical Computation of Positive Roots of Polynomials using Improved Bounds
نویسندگان
چکیده
The continued fraction method for isolating the positive roots of a univariate polynomial equation is based on Vincent’s theorem, which computes all of the real roots of polynomial equations. In this paper, we propose two new lower bounds which accelerate the fraction method. The two proposed bounds are derived from a theorem stated by Akritas et al., and use different pairing strategies for the coefficients of the target polynomial equations from the bounds proposed by Akritas et al. Numerical experiments show that the proposed lower bounds are more effective than existing bounds for some special polynomial equations and random polynomial equations, and are competitive with them for other special polynomial equations.
منابع مشابه
On Bounds for Real Roots of Polynomials
The computation of the real roots of univariate polynomials with real coefficients is done using several algorithmic devices. Many of them are based on the isolation of the real roots, i.e. the computation of a finite number of intervals with the property that each of them contains exactly one root. For that one of the steps is that of computing bounds for the roots. This can be realized using ...
متن کامل2 Estimates in Terms of a Polynomial Extremal Problem
We show that the Euclidean condition number of any positive deenite Hankel matrix of order n 3 may be bounded from below by n?1 =(16n) with = exp(4Catalan==) 3:210, and that this bound may be improved at most by a factor 8n. Similar estimates are given for the class of real Vandermonde matrices, the class of row scaled real Vandermonde matrices, and the class of Krylov matrices with Hermitian a...
متن کاملImproved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of ÕB(d + dτ + dτ) for isolating the real roots of a polynomial with integer coeffic...
متن کاملA numerical study of electrohydrodynamic flow analysis in a circular cylindrical conduit using orthonormal Bernstein polynomials
In this work, the nonlinear boundary value problem in electrohydrodynamics flow of a fluid in an ion-drag configuration in a circular cylindrical conduit is studied numerically. An effective collocation method, which is based on orthonormal Bernstein polynomials is employed to simulate the solution of this model. Some properties of orthonormal Bernstein polynomials are introduced and utilized t...
متن کاملImproved Computation of Bounds for Positive Roots of Polynomials
A new lower bound for computing positive roots of polynomial equations is proposed. We discuss a twostage algorithm for computing positive roots of polynomial equations. In the first stage, we use the continued fraction method based on Vincent’s theorem, which employs the lower bound of real roots, for isolating the positive roots into intervals. In the second stage, we apply a bisection method...
متن کامل